On Quaternary MacDonald Codes
نویسندگان
چکیده
This paper studies two families of codes over Z4, MacDonald codes of type α and type β. The torsion code, weight distribution, and Gray image properties are studied. Some interesting optimal binary codes are also obtained. Two nonlinear families of binary codes are obtained via the Gray map.
منابع مشابه
A Database of Z4 Codes
There has been much research on codes over Z 4 , sometimes called quaternary codes, for over a decade. Yet, no database is available for best known quaternary codes. This work introduces a new database for quaternary codes. It also presents a new search algorithm called genetic code search (GCS), as well as new quaternary codes obtained by existing and new search methods.
متن کاملA Database of $\mathbb{Z}_4$ Codes
There has been much research on codes over Z4, sometimes called quaternary codes, for over a decade. Yet, no database is available for best known quaternary codes. This work introduces a new database for quaternary codes. It also presents a new search algorithm called genetic code search (GCS), as well as new quaternary codes obtained by existing and new search methods.
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملNew Ternary and Quaternary Equidistant Constant Weight Codes
We consider the problem of finding bounds on the size of ternary and quaternary equidistant constant weight codes. We present a computer realization of an algorithm for solving the maximum clique problem. We use it for finding the exact values of the maximum size for ternary and quaternary equidistant constant weight codes for all open cases for n ≤ 10 are found.
متن کاملQuaternary Constant-Composition Codes with Weight Four and Distances Five or Six
The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal quaternary constant-composition codes with Hamming weight four and minimum distances five or six through group divisible codes and Roo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003